import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Solution {
    public List<Integer> stableMountains(int[] height, int threshold) {
        List<Integer> nums = new ArrayList<>();
        for (int i = 1; i < height.length; i++) {//下标从1开始，因为下标为0的山是不稳定的
            if(height[i-1] > threshold){//比较下标为i的左侧是否严格大于threshold
                nums.add(i);
            }
        }
        return nums;
    }

    public static void main(String[] args) {
        Scanner sca = new Scanner(System.in);
        while(sca.hasNext()){
            int n = sca.nextInt();//输入山的个数
            int[] heights = new int[n];
            for (int i = 0; i < heights.length; i++) {
                heights[i] = sca.nextInt();
            }
            int threshold = sca.nextInt();
            Solution solution = new Solution();
            List<Integer> nums = solution.stableMountains(heights,threshold);
            System.out.print("[");
            for(int i = 0; i < nums.size(); i++){
                System.out.print(nums.get(i));
                if(i < nums.size() - 1){
                    System.out.print(",");
                }
            }
            System.out.print("]");
        }
    }
}
